On Performance of Pre Computation of Quality of Service Routes

Quality of service (QoS) routing is the process of selecting the path to be used by the packets of a flow based on its QoS requirements and the resource availability of the network. In this paper, a new algorithm for pre computation of k constrained QoS routes is proposed and its performance is evaluated. QoS routing relies on state information specifying resource availability at network nodes and links in the form of a database, and uses it to find paths with enough free resources to accommodate new flows. QoS routes can either be selected on demand or they can be pre computed. Path pre computation schemes offer multiple candidate routes to each destination. The proposed algorithm is implemented for pre-computing k widest-shortest and shortest-widest optimal routes and performs better than the traditionally used algorithm.